On Cayley graphs of virtually free groups
نویسندگان
چکیده
منابع مشابه
On the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملFinite automata for Schreier graphs of virtually free groups
The Stallings construction for f.g. subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an efficient computation of the core of a Schreier graph based on edge folding. It is proved that those groups admitting Stallings sections are precisely f.g. virtually free groups, through a constructive approach based on Basse-Serre theory. Complexity issue...
متن کاملNORMAL 6-VALENT CAYLEY GRAPHS OF ABELIAN GROUPS
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
متن کاملOn Cayley Graphs of Abelian Groups
Let G be a finite Abelian group and Cay(G, S) the Cayley (di)-graph of G with respect to S, and let A = Aut Cay(G, S) and A1 the stabilizer of 1 in A. In this paper, we first prove that if A1 is unfaithful on S then S contains a coset of some nontrivial subgroup of G, and then characterize Cay(G, S) if AS 1 contains the alternating group on S. Finally, we precisely determine all m-DCI p-groups ...
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups – Complexity – Cryptology
سال: 2011
ISSN: 1867-1144,1869-6104
DOI: 10.1515/gcc.2011.012